perfect matching

Perfect Matching to a Kind of Hexagonal System

一类六角系统的完美匹配

The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G.

能惟一确定图G的完美匹配M的最小不交边子集所含的边数称作完美匹配M的强迫数。

For a simple graph G, Wu and Wang ( Graph Theory Notes of New York 39 ( 2000) 23-25) gave a necessary and sufficient condition for a jump graph J ( G) to have a perfect matching.

对于一个简单图G，吴和王（Graph Theory Notes of New York39（2000）23-25）给出了G的跳图有完美匹配的充分必要条件。

Dimension of Perfect Matching Polytope of Some Graphs

一些图的完美匹配多面体的维数

The wonderful and excelling design and color matching create perfect and harmonious arts.

巧夺天工的设计和多彩的色调搭配,造就艺术的完美和谐.

Boolean Mapping Algorithm Based on Perfect Matching of Bipartite Graph

基于二分图完美匹配的布尔匹配算法

One of G and H has a perfect matching and the other has a near perfect matching.

G和H中一个有完美匹配，另一个有几乎完美匹配。

The matching degree of vectors is gained in the way of developed perfect matching algorithm of bipartite graph.

运用改进的二分图的完美匹配算法，得到矢量数组的匹配度。

A graph G with a perfect matching is elementary if its allowed lines form a connected subgraph.

一个具有完美匹配的图G是基本的，如果由它的容许边所导出的子图是连通的。

Maximal Simple Graph without Perfect Matching

无完美对集最大简单图

An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.

提出了一种改进的基于二分图完美匹配的布尔匹配算法。

This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.

本文对一种目标函数为非线性函数的0&1规划问题提出了一种运用赋权偶图及完美对集的求解方法。

Based on duality theory of linear programming and graph theory, it is proved that the matching game defined on a bipartite graph has the stable core if and only if the graph has a perfect matching.

基于线性规划对偶理论和图论的相关知识，我们首先证明了匹配对策有稳定核心当且仅当其基础二部图有完美匹配。

Some results on toughness and fractional perfect matching s

关于图的韧度与分数完美对集的若干结果

G is said to be bipartite matching extendable if every matching M whose induced subgraph is a bipartite matching extends to a perfect matching.

称图G是偶匹配可扩的，是指G的每一个偶匹配都可以扩充成为G的一个完美匹配。

On 2-factors Containing Perfect Matching in Bipartite Graphs

二分图中含有完美对集的2-因子

He existence of perfect matching of self complementary graph is proved and the structure of maximum matching of self complementary graph is discussed in the article.

讨论了自补图的完美匹配的存在性和自补图的最大匹配问题。

It is an important factor for the perfect matching between the maximal input power of the hydraulic oil pump and the maximum output power of the engine in the design process of the hydraulic shovel.

液压油泵的最大输入功率与发动机的最大输出功率之间的匹配问题是液压挖掘机设计过程中的一个重要内容。

In this paper, a new method for image retrial using color moments of partitions and minimum cost perfect matching for a weighted bipartite graph based on im.

文中利用分块颜色矩，借助带权二部图的最小完美匹配提出了一种新的相似度量方法，既考虑了颜色的空间分布关系，又具有旋转、平移不变性。

At the same time, Chinese fans also increasingly sophisticated manufacturing and components increasingly perfect matching.

同时, 中国的风机制造业也日益成熟,零部件配套日渐完善.

The chain polyomino and it's number of perfect matching

链状四角系统及其完美匹配数

Wonderful hand-painting, perfect color-matching, rarefied costumes, all of these construct a China-style comic.

精湛的手绘技巧, 完美的配色, 考究的道具服饰, 惟妙惟肖的人物构成这一幅极具国风的画作.

The Energy of Unicyclic Graphs with a Perfect Matching

具有完美匹配的单圈图的能量

Let G be a finite simple connected graph with a perfect matching.

设G是一个连通的简单图且具有完美匹配。

In the molecular orbital theory, the molecule of the conjugated hydrocarbons considered generally can be represented in carbon-atom skeleton graph, the character of this kind of graphs is that all vertices have degree no greater than three and have a perfect matching.

在分子轨道理论中，所考虑的共轭碳氢化合物的分子常用碳原子骨架图来表示，此类图的特征是所有顶点的度不超过3，并且具有完美匹配。

A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights

赋双权二部图中最大权最小权完美匹配

Material tank is perfect matching with grinding basket, very high process efficiency.

研磨筒与篮子尺寸最佳匹配，研磨效率高。

In recent years, some researchers have proposed some DNA algorithm to solve MMP, such as plasmid-model and surface-model to solve MMP and sticker-model to solve perfect matching problem.

近年来，已经有些学者提出了一些针对匹配问题的DNA算法，如基于质粒模型、表面模型求解最大匹配问题；基于粘贴模型求解完美匹配等。

The DNA molecules of the solution space are fixed on the solid carrier, and then we get the all solutions of the perfect matching problem by the biochemical actions.

该模型首先将问题解空间的DNA分子固定在固体载体上，然后通过进行相应的生化反应来求得哈密顿回路问题的所有解。

To be specific, we introduce the Coxeter system, the symmetric group, Dyck path, perfect matching and so on.

具体而言，我们介绍了Coxeter系统、对称群、排列统计量、Dyck路、完美匹配等。